Explaining human mobility predictions through a pattern matching algorithm

نویسندگان

چکیده

Abstract Understanding what impacts the predictability of human movement is a key element for further improvement mobility prediction models. Up to this day, such analyses have been conducted using upper bound mobility. However, later works indicated discrepancies between and accuracy actual predictions suggesting that estimation not accurate. In work, we confirm these and, instead measure, focus on explaining predictions. We show dependent similarity transitions observed in training test sets derived from data. propose evaluate five pattern matching based-measures, which allow us quickly estimate potential As result, find our metrics can explain up 90% its variability. also measures were proved variability fail accuracy. This suggests measure should be compared. Our used assess how predictable data will algorithms. share developed as part HuMobi, open-source Python library.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A FAST Pattern Matching Algorithm

The advent of digital computers has made the routine use of pattern-matching possible in various applications. This has also stimulated the development of many algorithms. In this paper, we propose a new algorithm that offers improved performance compared to those reported in the literature so far. The new algorithm has been evolved after analyzing the well-known algorithms such as Boyer-Moore,...

متن کامل

A Simple Fast Hybrid Pattern-Matching Algorithm

The Knuth–Morris–Pratt (KMP) pattern-matching algorithm guarantees both independence from alphabet size and worst-case execution time linear in the pattern length; on the other hand, the Boyer–Moore (BM) algorithm provides near-optimal average-case and best-case behaviour, as well as executing very fast in practice. We describe a simple algorithm that employs the main ideas of KMP and BM (with ...

متن کامل

A Dictionary-Based Compressed Pattern Matching Algorithm

Compressed pattern matching refers to the process of, given a text in a compressed form and a pattern, finding all the occurrences of the pattern in the text without decompression. To utilize bandwidth more effectively in the Internet environment, it is highly desirable that data be kept and sent over the Internet in the compressed form. In order to support information retrieval for compressed ...

متن کامل

A Fast Multiple String-pattern Matching Algorithm

In this paper, we propose a simple but eecient multiple string pattern matching algorithm based on a compact encoding scheme. This algorithm scans text from left to right while encoding characters in the text based on the alphabet that occurs in the input patterns. The simple scanning algorithm demonstrates the ability to handle a very large number of input patterns simultaneously. Our experime...

متن کامل

A Quantum Algorithm for Closest Pattern Matching

We propose a quantum algorithm for closest pattern matching which allows us to search for as many distinct patterns as we wish in a given string (database), requiring a query function per symbol of the pattern alphabet. This represents a significant practical advantage when compared to Grover’s search algorithm as well as to other quantum pattern matching methods [7], which rely on building spe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: EPJ Data Science

سال: 2022

ISSN: ['2193-1127']

DOI: https://doi.org/10.1140/epjds/s13688-022-00356-4